A Multicore Exact Algorithm for Addition Sequence

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quasi-Exact Sequence and Finitely Presented Modules

The notion of quasi-exact sequence of modules was introduced by B. Davvaz and coauthors in 1999 as a generalization of the notion of exact sequence. In this paper we investigate further this notion. In particular, some interesting results concerning this concept and torsion functor are given.

متن کامل

An Exact Algorithm for the Mode Identity Project Scheduling Problem

In this paper we consider the non-preemptive variant of a multi-mode resource constrained project scheduling problem (MRCPSP) with mode identity, in which a set of project activities is partitioned into disjoint subsets while all activities forming one subset have to be processed in the same mode. We present a depth-first branch and bound algorithm for the resource constrained project schedulin...

متن کامل

Multicore Learning Algorithm

The focus of our term project is to apply the map-reduce principle to a variety of machine learning algorithms that are computationally expensive. Instead of using expensive computer clusters, we focus on implementing the framework on multi-core computer environment. On top of that, in order to apply the framework to a variety of modern machine learning algorithms, we focus on parallelize the s...

متن کامل

A Birman exact sequence for AutpFnq

The Birman exact sequence describes the effect on the mapping class group of a surface with boundary of gluing discs to the boundary components. We construct an analogous exact sequence for the automorphism group of a free group. For the mapping class group, the kernel of the Birman exact sequence is a surface braid group. We prove that in the context of the automorphism group of a free group, ...

متن کامل

Multicore and Manycore for Algorithm Engineers

From June 27 to July 2, the Dagstuhl Seminar 10261 Algorithm Engineering was held in Schloss Dagstuhl Leibniz Center for Informatics. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computers

سال: 2019

ISSN: 1796-203X

DOI: 10.17706/jcp.14.1.79-87